Lowest priority waiting time distribution in an accumulating priority Lévy queue
نویسندگان
چکیده
منابع مشابه
Strategic Bidding in an Accumulating Priority Queue: Equilibrium Analysis
We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/1 queue. We formulate a non-cooperative game in which customers purchase priority coefficients with the goal of reducing (possibly heterogeneous) waiting costs in exchange. The priority of each customer in the queue is a linear function of the individual waiting time, with the purchased coefficient bei...
متن کاملApproximations for the waiting - time distribution in an M / P H / c priority queue
We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a nonpreemptive M/P H/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the first two moments of the waiting time per class given that all servers are occupied. These wait...
متن کاملApproximations for the waiting time distribution in an M/G/c priority queue
We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/G/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the first two moments of the waiting time per class given that all servers are occupied. These waiti...
متن کاملNorwegian Priority Setting in Practice – an Analysis of Waiting Time Patterns Across Medical Disciplines
Background Different strategies for addressing the challenge of prioritizing elective patients efficiently and fairly have been introduced in Norway. In the time period studied, there were three possible outcomes for elective patients that had been through the process of priority setting: (i) high priority with assigned individual maximum waiting time; (ii) low priority without a maximum waitin...
متن کاملWaiting times of the Multiple Priority Dual Queue with Finite Buffer and Non- Preemptive Priority Scheduling
This paper considers a novel queueing model called the Multi-Priority Dual Queue (MPDQ), which was introduced and analyzed in Bedford and Zeephongsekul [1, 2]. The MPDQ consists of two queues with a finite buffer, the primary and the secondary queue with the additional feature of a priority scheme to assist with congestion control and meeting Quality of Service ( ) QoS objectives for differenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2017
ISSN: 0167-6377
DOI: 10.1016/j.orl.2016.11.007